CLOSURE SYSTEMS AND CLOSURE OPERATIONS IN DEDEKIND CATEGORIES
نویسندگان
چکیده
منابع مشابه
Closure Systems and Closure Operations in Dedekind
The concepts of closure systems and closure operations in lattice theory are basic and applied to many fields in mathematics and theoretical computer science. In this paper authors find out a suitable definition of closure systems in Dedekind categories, and thereby give an equivalence proof for closure systems and closure operations in Dedekind categories.
متن کاملClosure operations in phylogenetics.
Closure operations are a useful device in both the theory and practice of tree reconstruction in biology and other areas of classification. These operations take a collection of trees (rooted or unrooted) that classify overlapping sets of objects at their leaves, and infer further tree-like relationships. In this paper we investigate closure operations on phylogenetic trees; both rooted and unr...
متن کاملFrom torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملClosure and Telicity across Categories
One of the fascinating aspects of telicity is its relations with non-verbal categories. Whether a given predicate is telic or atelic does not only depend on the verb, but can also be affected by the count/mass quantification in the NP object, by the lexical semantics of related adjectives, and by the prepositions that the predicate may contain. The latter two factors are in the focus of this pa...
متن کاملDeletion operations: closure properties.dvi
The paper studies some variants of deletion operations which generalize the left/right quotient of languages. The main emphasis is put on how these deletions can be expressed as a combination of other operations, and on closure properties of various language families under deletion. Some results are the expected ones: the sequential (iterated sequential, dipolar) deletion from a regular languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 2008
ISSN: 0286-522X
DOI: 10.5109/18996